Self-stabilizing Cuts in Synchronous Networks
نویسندگان
چکیده
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all unsatisfied nodes change sides independently with a fixed probability p. Using different notions of satisfaction enables the computation of maximal and minimal cuts, respectively. We analyze the expected time until such cuts are reached on several graph classes and consider the impact of the parameter p and
منابع مشابه
Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract)
Power-supply, a surprisingly simple and new general paradigm for the development of self-stabilizing algorithms in diierent models, is introduced. The paradigm is exempliied by developing simple and eecient self-stabilizing algorithms for leader election and either BFS or DFS spanning tree constructions, in strongly-connected unidirectional and bi-directional dynamic networks (synchronous and a...
متن کاملLow-Communication Self-stabilizing Leader Election in Large Networks
This paper makes two contributions: (1) On a completely connected network of n anonymous processes, it presents a synchronous randomized algorithm to solve the weak leader election problem in expected O(1) time using O( √ n logn) messages with high probability, (2) It presents a self-stabilizing algorithm for the strong leader election problem on a completely connected network of processes with...
متن کاملSelf-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs
We investigate self-stabilizing rendezvous algorithms for two synchronous mobile agents. The rendezvous algorithms make two mobile agents meet at a single node, starting from arbitrary initial locations and arbitrary initial states. We study deterministic algorithms for two synchronous mobile agents with different labels but without using any whiteboard in the graph. First, we show the existenc...
متن کاملSelf-Stabilization with Global Rooted Synchronizers
We propose a self-stabilizing synchronization technique, called the Global Rooted Synchronization, that synchronizes processors in a tree network. This synchronizer converts a synchronous protocol for tree networks into a self-stabilizing version. The synchronizer requires only O(1) memory (other than the memory needed to maintain the tree) at each node regardless of the size of the network, st...
متن کاملSelf-stabilizing Byzantine Digital Clock Synchronization
We present a scheme that achieves self-stabilizing Byzantine digital clock synchronization assuming a “synchronous” system. This synchronous system is established by the assumption of a common external “beat” delivered with a regularity in the order of the network message delay, thus enabling the nodes to execute in lock-step. The system can be subjected to severe transient failures with a perm...
متن کامل